From Structural Syntax to Constructive Adpositional Grammars
نویسندگان
چکیده
The importance of the research made by Tesnière (1959) for the concepts of dependency and valency cannot be underestimated. However, his Structural Syntax remains still uninvestigated in most part. In this paper, a formal grammar model that follows Tesnière’s intuitions and concepts as much as possible is proposed. This model is called constructive adpositional grammar. This paper explains the linguistic and formal reasons behind such a research plan.
منابع مشابه
Grammatical inference of graph grammars for syntactic pattern recognition
This paper presents a new approach to the use of graph grammars for syntactic pattern recognition. First an introduction concerning the representation of complex two or three-dimensional patterns with labelled nodes and edges is given. Then follows the definition of a special class of graph grammars with rules producing chainand starstructured subgraphs. A constructive inference algorithm is de...
متن کاملMeaning to Learn: Bootstrapping Semantics to Infer Syntax
Context-free grammars cannot be identified in the limit from positive examples (Gold 1967), yet natural language grammars are more powerful than context-free grammars and humans learn them with remarkable ease from positive examples (Marcus 1993). Identifiability results for formal languages ignore a potentially powerful source of information available to learners of natural languages, namely, ...
متن کاملRepresentational Formalism in Which Syntax and Semantics Are Congruent: Towards the Resolution of Searle’s Chinese Room Challenge
A recently developed formalism for structural representation, called Evolving Transformations System (ETS)—in which syntax and semantics are congruent—suggests an unforeseen constructive resolution to the ubiquitous syntax/semantics incompatibility issue raised by Searle’s Chinese Room argument. The ETS is an outcome of long-term research work directed at the development of a category-oriented ...
متن کاملAlpha-Structural Induction and Recursion for the Lambda Calculus in Constructive Type Theory
We formulate principles of induction and recursion for a variant of lambda calculus in its original syntax (i.e., with only one sort of names) where α-conversion is based upon name swapping as in nominal abstract syntax. The principles allow to work modulo α-conversion and implement the Barendregt variable convention. We derive them all from the simple structural induction principle on concrete...
متن کاملSynchronous Dependency Insertion Grammars: A Grammar Formalism For Syntax Based Statistical MT
This paper introduces a grammar formalism specifically designed for syntax-based statistical machine translation. The synchronous grammar formalism we propose in this paper takes into consideration the pervasive structure divergence between languages, which many other synchronous grammars are unable to model. A Dependency Insertion Grammars (DIG) is a generative grammar formalism that captures ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011